A Direct Projection Method for Sparse Linear Systems

نویسندگان

  • Michele Benzi
  • Carl Dean Meyer
چکیده

An oblique projection method is adapted to solve large, sparse, unstructured systems of linear equations. This row-projection technique is a direct method which can be interpreted as an oblique Kaczmarz-type algorithm, and is also related to other standard solution methods. When a sparsity-preserving pivoting strategy is incorporated, it is demonstrated that the technique can be superior, in terms of both fill-in and arithmetic complexity, to more standard sparse algorithms based on gaussian elimination. This is especially true for systems arising from stiff ordinary differential equations problems in chemical kinetics studies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

Motivated by the paper [16], where the authors proposed a method to solve a symmetric positive definite (SPD) system Ax = b via a sparse-sparse iterative-based projection method, we extend this method to nonsymmetric linear systems and propose a modified method to construct a sparse approximate inverse preconditioner by using the Frobenius norm minimization technique in this paper. Numerical ex...

متن کامل

Some Developed Direct and Iterative Methods for Solving Sparse Linear Systems of Equations

In this paper, efficient direct and iterative methods are described for solving a large random sparse non-symmetric linear system. Such systems of linear equations of huge order arise in several applications such as physics, mechanics, signal processing and other applications of real life problems. For this reason, we try to develop direct and iterative methods for solving such systems of linea...

متن کامل

CAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS

In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...

متن کامل

Sparse Matrix Ordering Methods for Interior Point

The main cost of solving a linear programming problem using an interior point method is usually the cost of solving a series of sparse, symmetric linear systems of equations, AA T x = b. These systems are typically solved using a sparse direct method. The rst step in such a method is a reordering of the rows and columns of the matrix to reduce ll in the factor and/or reduce the required work. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1995